Rydberg Wire Gates for Universal Quantum Computation
نویسندگان
چکیده
Rydberg atom arrays offer flexible geometries of strongly interacting neutral atoms, which are useful for many quantum applications such as simulation and computation. Here, we consider an all-optical gate-based computing scheme the arrays, in auxiliary atoms (wire atoms) used a mean quantum-mechanical remote-couplings among data-qubit optical individual-atom addressing data wire is to construct universal gates atoms. The working principle our use coupling mediation only, while leaving them noncoupling ground states before after each gate operation, allows double-excited qubits be accessible by sequence π or /2 pulses Optical pulse sequences constructed standard one-, two-, multi-qubit gates, arbitrary two-qubit state preparation considered computation prospects. We further provide detailed resource estimate experimental implementation this simulator.
منابع مشابه
Two-bit gates are universal for quantum computation.
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the universality of three-bit gates, by analogy to the universality of the Toffoli three-bit gate of classical reversible computing. Two-bit quantum gates may be imple...
متن کاملUniversal Quantum Gates for Tensors
A universal quantum gate is introduced for tensors of vector spaces. By using integer powers of such a gate and by using classical reversible gates one can approximate any element of the unitary group to any accuracy needed. The proof uses a version of Kronecker's theory and the structure of the Bloch sphere for tensors.
متن کاملUniversal quantum computation with ideal Clifford gates and noisy ancillas
We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state u0l, and qubit measurement in the computational basis. In addition, we allow the creation of a one-qubit ancilla in a mixed state r, which should be regarded as a parameter of the model. Our goal is to determine for which r universal quantum computatio...
متن کاملElementary gates for quantum computation.
We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values (x, y) to (x, x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2n)) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized D...
متن کاملElementary Gates for Quantum Computation
(quant-ph/9503007) 36] R. Landauer, \Is quantum mechanics useful?", Proc. Roy. Soc. Lond., (to be published). 37] The only non-trivial one-bit classical invertible operation is 0 1 1 0. 41] Corresponding with the deenition in the previous section, the top two wires contain the input bits x 1 and x 2 , and the third wire contains the input y). 42] The angle-halving of this deenition conforms to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Physics
سال: 2022
ISSN: ['2296-424X']
DOI: https://doi.org/10.3389/fphy.2022.875673